- admissible pair
- мат.допустимая пара
English-Russian scientific dictionary. 2008.
admissible pair
Смотреть что такое "admissible pair" в других словарях:
Admissible rule — In logic, a rule of inference is admissible in a formal system if the set of theorems of the system is closed under the rule. The concept of an admissible rule was introduced by Paul Lorenzen (1955).DefinitionsThe concept of admissibility, as… … Wikipedia
Admissible representation — In mathematics, admissible representations are a well behaved class of representations used in the representation theory of reductive Lie groups over real or p adic fields. They were introduced by Harish Chandra.Real reductive groupsFor real… … Wikipedia
Gelfand pair — In mathematics, the expression Gelfand pair refers to a pair ( G , K ) consisting of a group G and a subgroup K that satisfies a certain property on restricted representations.When G is a finite group the simplest definition is, roughly speaking … Wikipedia
GÉOMÉTRIE DIFFÉRENTIELLE CLASSIQUE — L’histoire des courbes planes est intimement liée à l’histoire et aux développements du calcul infinitésimal, et les premiers résultats obtenus au XVIIe siècle sont directement issus de considérations géométriques et cinématiques (cf. CALCUL… … Encyclopédie Universelle
Local consistency — In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. Several such conditions exist, the most known being node consistency,… … Wikipedia
General frame — In logic, general frames (or simply frames) are Kripke frames with an additional structure, which are used to model modal and intermediate logics. The general frame semantics combines the main virtues of Kripke semantics and algebraic semantics:… … Wikipedia
A* search algorithm — In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… … Wikipedia
plausible — [ plozibl ] adj. • 1552; lat. plausibilis « digne d être applaudi » ♦ Qui semble devoir être admis. ⇒ admissible, vraisemblable. Caractère plausible d un événement. Cause, raison très plausible. ⇒ probable. « Ce motif n était pas le véritable,… … Encyclopédie Universelle
Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… … Wikipedia
Kripke–Platek set theory — The Kripke–Platek axioms of set theory (KP) (IPAEng|ˈkrɪpki ˈplɑːtɛk) are a system of axioms of axiomatic set theory, developed by Saul Kripke and Richard Platek. The axiom system is written in first order logic; it has an infinite number of… … Wikipedia
Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… … Wikipedia
